BIT Submitted May 1997, Revised February 1998. A TOTAL LEAST SQUARES METHOD FOR TOEPLITZ SYSTEMS OF EQUATIONS
نویسندگان
چکیده
A Newton method to solve total least squares problems for Toeplitz systems of equations is considered. When coupled with a bisection scheme, which is based on an eecient algorithm for factoring Toeplitz matrices, global convergence can be guaranteed. Circulant and approximate factorization preconditioners are proposed to speed convergence when a conjugate gradient method is used to solve linear systems arising during the Newton iterations.
منابع مشابه
A Total Least Squares Methodfor Toeplitz
A Newton method to solve total least squares problems for Toeplitz systems of equations is considered. When coupled with a bisection scheme, which is based on an eecient algorithm for factoring Toeplitz matrices, global convergence can be guaranteed. Circulant and approximate factorization preconditioners are proposed to speed convergence when a conjugate gradient method is used to solve linear...
متن کاملSolution of Toeplitz Normal Equations by Sine Transform Based Preconditioning
The normal equations constructed by a Toeplitz matrix are studied, in order to nd a suitable preconditioner related to the discrete sine transform. New results are given about the structure of the product of two Toeplitz matrices, which allow the CGN method to achieve a superlinear rate of convergence. This preconditioner outperforms the circulant one for the iterative solution of Toeplitz leas...
متن کاملComputationally efficient weighted least-squares design of FIR filters satisfying prescribed magnitude and phase specifications
An efficient method for the design of FIR filters satisfying prescribed magnitude and phase specifications is described. The method involves formulating an objective function in a quadratic form. The filter coefficients are obtained by solving a system of linear equations which involves either a Toeplitz matrix or a Toeplitz-plus-Hankel matrix. The computational complexity associated with such ...
متن کاملNumerical Stability of Some FastAlgorithms for Structured
We consider the numerical stability/instability of fast algorithms for solving systems of linear equations or linear least squares problems with a low displacement-rank structure. For example, the matrices involved may be Toeplitz or Hankel. In particular, we consider algorithms which incorporate pivoting without destroying the structure, such as the Gohberg-Kailath-Olshevsky (GKO) algorithm, a...
متن کاملStability of fast algorithms for structured linear systems
We survey the numerical stability of some fast algorithms for solving systems of linear equations and linear least squares problems with a low displacement-rank structure. For example, the matrices involved may be Toeplitz or Hankel. We consider algorithms which incorporate pivoting without destroying the structure, and describe some recent results on the stability of these algorithms. We also ...
متن کامل